On polynomial-time solvable linear Diophantine problems
نویسندگان
چکیده
منابع مشابه
A Class of Linear Complementarity Problems Solvable in Polynomial Time
We describe a “condition” number for the linear complementarity problem (LCP), which characterizes the degree of difficulty for its solution when a potential reduction algorithm is used. Consequently, we develop a class of LCPs solvable in polynomial time. The result suggests that the convexity (or positive semidefiniteness) of the LCP may not be the basic issue that separates LCPs solvable and...
متن کاملTwo Polynomial Time Solvable Multicommodity Flow Problems
The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations.
متن کاملA perspective on certain polynomial-time solvable classes of satisfiability
The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contain many challenging formulas. Yet, we find that, in some sense, the matched formulas are more nume...
متن کاملCan a System of Linear Diophantine Equations be Solved in Strongly Polynomial Time?
We demonstrate that the answer to the question posed in the title is “yes” and “no”: “no” if the set of permissible operations is restricted to {+,−,×,/,mod,<}; “yes” if we are also allowed a gcd-oracle as a permissible operation. It has been shown (see [Sto76, MST91]) that no strongly polynomial algorithm exists for the problem of finding the greatest common divisor (gcd) of two arbitrary inte...
متن کاملPolynomial-time Word Problems
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble straight line programs, which are widely studied in the theory of compressed d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow Journal of Combinatorics and Number Theory
سال: 2019
ISSN: 2640-7361,2220-5438
DOI: 10.2140/moscow.2019.8.357